First-order rewritability of ontology-mediated queries in linear temporal logic

We investigate ontology-based data access to temporal data. consider ontologies given in linear logic LTL interpreted over discrete time (Z,<). Queries are or MFO(<), monadic first-order with a built-in order. Our concern is rewritability of ontology-mediated queries (OMQs) consisting ontology and query. By taking account the operators used distinguishing between full its core, Krom Horn fragments, we identify hierarchy OMQs atomic by proving into either FO(<), order, FO(<,E), which extends FO(<) standard arithmetic predicates saying that "x equivalent 0 modulo n", for any fixed n > 1, FO(RPR), relational primitive recursion. In terms circuit complexity, FO(<,E)- FO(RPR)-rewritability guarantee OMQ answering uniform AC0 and, respectively, NC1. obtain similar hierarchies more expressive types queries: positive LTL-formulas, monotone MFO(<)- arbitrary MFO(<)-formulas. results directly applicable if be accessed one-dimensional; moreover, they lay foundations investigating using combinations description logics two-dimensional